Curve41417: Karatsuba Revisited
نویسندگان
چکیده
This paper introduces constant-time ARM Cortex-A8 ECDH software that (1) is faster than the fastest ECDH option in the latest version of OpenSSL but (2) achieves a security level above 2 using a prime above 2. For comparison, this OpenSSL ECDH option is not constant-time and has a security level of only 2. The new speeds are achieved in a quite different way from typical prime-field ECC software: they rely on a synergy between Karatsuba’s method and choices of radix smaller than the CPU word size.
منابع مشابه
414-bit multiplication on the ARM Cortex-M0
This thesis presents a low-level implementation of 414-bit multiplication on the ARM Cortex-M0, using four levels of Karatsuba and one level of schoolbook multiplication. This multiplication is an important part of Curve41417 created by D. Bernstein and T. Lange. This implementation requires 4014 clock cycles.
متن کاملMissing a trick: Karatsuba revisited
There are a variety of ways of applying the Karatsuba idea to multi-digit multiplication. These apply particularly well in the context where digits do not use the full word-length of the computer, so that partial products can be safely accumulated without fear of over ow. Here we re-visit the arbitrary degree version of Karatsuba and show that the cost of this little-known variant has been over...
متن کاملOverlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms for Hardware Implementations
We describe how a simple way to split input operands allows for fast VLSI implementations of subquadratic GF (2)[x] Karatsuba-Ofman multipliers. The theoretical XOR gate delay of the resulting multipliers is reduced significantly. For example, it is reduced by about 33% and 25% for n = 2 and n = 3 (t > 1), respectively. To the best of our knowledge, this parameter has never been improved since ...
متن کاملImplementation of Karatsuba Algorithm Using Polynomial Multiplication
Abstract Efficiency in multiplication is very important in applications like signal processing, cryptosystems and coding theory. This paper presents the design of a fast multiplier using the Karatsuba algorithm to multiply two numbers using the technique of polynomial multiplication. The Karatsuba algorithm saves coefficient multiplications at the cost of extra additions as compared to the ordi...
متن کاملCryptography By Karatsuba Multiplier with ASCII Codes
In this paper we describe Cryptography by using Karatsuba multipliers and ASCII codes implementing through coordinate geometry for data encryption and decryption with its code in matlab. Elliptic curve cryptography is an asymmetric key cryptography. It includes (i) public key generation on the elliptic curve and its declaration for data encryption and (ii) private key generation and its use in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014